10 research outputs found

    A note on drastic product logic

    Full text link
    The drastic product D*_D is known to be the smallest tt-norm, since xDy=0x *_D y = 0 whenever x,y<1x, y < 1. This tt-norm is not left-continuous, and hence it does not admit a residuum. So, there are no drastic product tt-norm based many-valued logics, in the sense of [EG01]. However, if we renounce standard completeness, we can study the logic whose semantics is provided by those MTL chains whose monoidal operation is the drastic product. This logic is called S3MTL{\rm S}_{3}{\rm MTL} in [NOG06]. In this note we justify the study of this logic, which we rechristen DP (for drastic product), by means of some interesting properties relating DP and its algebraic semantics to a weakened law of excluded middle, to the Δ\Delta projection operator and to discriminator varieties. We shall show that the category of finite DP-algebras is dually equivalent to a category whose objects are multisets of finite chains. This duality allows us to classify all axiomatic extensions of DP, and to compute the free finitely generated DP-algebras.Comment: 11 pages, 3 figure

    Densification of FL chains via residuated frames

    Get PDF
    The final publication is available at Springer via https://doi.org/10.1007/s00012-016-0372-5.We introduce a systematic method for densification, i.e., embedding a given chain into a dense one preserving certain identities, in the framework of FL algebras (pointed residuated lattices). Our method, based on residuated frames, offers a uniform proof for many of the known densification and standard completeness results in the literature. We propose a syntactic criterion for densification, called semianchoredness. We then prove that the semilinear varieties of integral FL algebras defined by semi-anchored equations admit densification, so that the corresponding fuzzy logics are standard complete. Our method also applies to (possibly non-integral) commutative FL chains. We prove that the semilinear varieties of commutative FL algebras defined by knotted axioms xm=xn (with m,n>1) admit densification. This provides a purely algebraic proof to the standard completeness of uninorm logic as well as its extensions by knotted axioms.Austrian Science Fund (FWF)Japan Society for the Promotion of Science (JSPS
    corecore